Efficient Gaussian Elimination on a 2D SIMD Array of Processors without Column Broadcasts
نویسنده
چکیده
În această lucrare se prezintă o metodă eficientă de implementare a eliminării Gaussiene pentru o matrice de dimensiuni n·m (m≥n), folosind o arhitectură SIMD ce constă dintr-o matrice de n·m procesoare. Algoritmul descris constă în 2·n-1=O(n) iteraţii, oferind astfel o creştere de viteză optimă faţă de versiunea serială. O particularitate a algoritmului este că nu necesită realizarea operaţiei de broadcast decât pe liniile, nu şi pe coloanele, matricii de procesoare. Lucrarea prezintă, de asemenea, o serie de extensii şi aplicaţii ale algoritmului de eliminare Gaussiană.
منابع مشابه
SIMD Algorithms For 2 - D Arrays In Shuffle Networks
This paper studies a set of 2-D basic algorithms for SIMD perfect shuffle networks. Those algorithms where studied in [1] and [SN], but for the 1-D case, where the size of the problem N is the same as the number of processors P. For the 2-D case of N = L * P, we improve some algorithms to be "2-D efficient", by improving their running time from Ο(L *logP) to Ο(L + logP), as N exceeds P. We give...
متن کاملParallel Architecture for the Solution of Linear Equations Systems Based on Division Free Gaussian Elimination Method Implemented in FPGA
This paper presents a parallel architecture for the solution of linear equations systems based on the Division Free Gaussian Elimination Method. This architecture was implemented in a Field Programmable Gate Array (FPGA). The division-free Gaussian elimination method was integrated in identical processors in a FPGA Spartan 3 of Xilinx. A top-down design was used. The proposed architecture can h...
متن کاملParallel Processors Architecture in FPGA for the Solution of Linear Equations Systems
This paper presents a parallel array of processors implemented in a Field Programmable Gate Array (FPGA) for the solution of linear equations systems. The solution is performed using the division-free Gaussian elimination method. This algorithm was implemented in integrated processors in a FPGA Spartan 3 of Xilinx. A top-down design was used. The proposed architecture can handle IEEE 754 single...
متن کاملDesign of Optimal Array Processors for Two-Step Division-Free Gaussian Elimination
The design of array processors for solving linear systems using two-step division-free Gaussian elimination method is considered. The two-step method can be used to improve the systems based on the one-step method in terms of numerical stability as well as the requirements for high-precision. In spite of the rather complicated computations needed at each iteration of the two-step method, we dev...
متن کاملImplementation of an Ad 1 Method on Pafullel C 0 Mputew
In this paper we discuss the implementation of an AD1 method for solving the diffusion equation on three paralleYvector computers. The computers were chosen so as to encompass a variety of architectures. They are: the MPP, an SIMD machine with 16K bit serial processors; FLEW32, an MIMD machine with 20 processors; and CRAY/2, an MIMD machine with four vector pmessm. The Gaussian elimination algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0912.2047 شماره
صفحات -
تاریخ انتشار 2009